On the general position number of two classes of graphs

Abstract The general position problem is to find the cardinality of largest vertex subset S S such that no triple vertices lies on a common geodesic. For connected graph G G , denoted by gp ( ) {\rm{gp}}\left(G) and called {\rm{gp}} -number (or number) . In paper, we obtain an upper bound lower regarding in all cacti with k k cycles t t pendant edges. Furthermore, exact value wheel graphs determined.